Dynamic Probabilistic Broadcast based on Neighbour Discovery
نویسندگان
چکیده
Abstract Broadcasting in Ad hoc networks is an important information dissemination way. However, flooding may give rise to broadcast storm problem which causes severe contention, collision and delay. This paper proposes a dynamic probabilistic algorithm based on neighbour discovery that ensures the higher reliability at lower retransmission. The forwards from node (INode) has obtained it (UNode) not received it. By counting number of UNode INode neigbors, INodes dynamically adjust probability broadcasting reduce replication but cover more UNodes. Dynamic can only effectively retransmission, also ensure effectiveness reliability. Simulation results show this significantly than other algorithms.
منابع مشابه
Dynamic probabilistic routing discovery and broadcast schemes for high mobility ad-hoc networks
Mobile Ad-hoc Networks (MANETs) have lately come to be widely used in everyday applications. Their usability and capability have attracted the interest of both commercial organizations and research communities. Recently, the Vehicular Ad-hoc Network (VANET) is a promising application of MANETs. It has been designed to offer a high level of safety for the drivers in order to minimize a number of...
متن کاملNeighbour Discovery in IPv6
IPv6 is the new network layer protocol, which is sought to eventually replace the existing IPv4 protocol as the standard of choice used throughout the global internet. Brought about initially due to urgent requirement for more available IP addresses, IPv6 also aims to provide substantial improvements on the old protocol and introduce entirely new innovations. One such improvement which includes...
متن کاملNeighbour Discovery in Active Networks
Active networks consist of traditional routers and active network nodes (ANN). Some aspects of active networks operation, e.g. security and interoperability, require each ANN to know its neighbour ANNs. However, neighbour ANNs are not directly connected, i.e. there may be one or more plain routers between them. This makes the discovery of neighbour ANNs a non trivial task and fundamentally diff...
متن کاملRNN (Reverse Nearest Neighbour) in Unproven Reserve Based Outlier Discovery
Outlier detection refers to task of identifying patterns. They don’t conform establish regular behavior. Outlier detection in highdimensional data presents various challenges resulting from the “curse of dimensionality”. The current view is that distance concentration that is tendency of distances in high-dimensional data to become in discernible making distance-based methods label all points a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of physics
سال: 2023
ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']
DOI: https://doi.org/10.1088/1742-6596/2575/1/012007